Nearly-Deterministic Methods for Optimising Protein Geometry
نویسندگان
چکیده
c © 2008 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher mentioned above.
منابع مشابه
Nearly linear time encodable codes beating the Gilbert-Varshamov bound
We construct explicit nearly linear time encodable error-correcting codes beating the Gilbert-Varshamov bound. Our codes are algebraic geometry codes built from the Garcia-Stichtenoth function field tower and beat the Gilbert-Varshamov bound for alphabet sizes at least $19^2$. Messages are identified with functions in certain Riemann-Roch spaces associated with divisors supported on multiple pl...
متن کاملA Deterministic Polynomial Space Construction for eps-nets under any Norm
We give a deterministic polynomial space construction for nearly optimal ǫ-nets with respect to any input n-dimensional convex body K and norm ‖ · ‖. More precisely, our algorithm can build and iterate over an ǫ-net of K with respect to ‖ · ‖ in time 2 × ( size of the optimal net ) using only poly(n)space. This improves on previous constructions of [ASL13] which achieve either a 2 approximation...
متن کاملA Deterministic Polynomial Space Construction for -nets under any Norm
We give a deterministic polynomial space construction for nearly optimal -nets with respect to any input n-dimensional convex body K and norm ‖ · ‖. More precisely, our algorithm can build and iterate over an -net of K with respect to ‖ · ‖ in time 2 × ( size of the optimal net ) using only poly(n)space. This improves on previous constructions of [ASL13] which achieve either a 2 approximation o...
متن کاملEfficient Dynamic Embeddings of Binary Trees into Hypercubes
In this paper, a deterministic algorithm for dynamically embedding binary trees into hypercubes is presented. Because of a known lower bound, any such algorithm must use either randomization or migration, i.e., remapping of tree vertices, to obtain an embedding of trees into hypercubes with small dilation, load, and expansion simultaneously. Using migration of previously mapped tree vertices, t...
متن کاملEecient Dynamic Embeddings of Binary Trees into Hypercubes
In this paper, a deterministic algorithm for dynamically embedding binary trees into hypercubes is presented. Because of a known lower bound, any such algorithm must use either randomization or migration, i.e., remapping of tree vertices, to obtain an embedding of trees into hypercubes with small dilation, load, and expansion simultaneously. Using migration of previously mapped tree vertices, t...
متن کامل